Decidable Higher-Order Unification Problems
نویسنده
چکیده
Second order uni cation is undecidable in general Miller showed that uni cation of so called higher order patterns is decidable and unitary We show that the uni cation of a linear higher order pat tern s with an arbitrary second order term that shares no variables with s is decidable and nitary A few extensions of this uni cation problem are still decidable unifying two second order terms where one term is linear is undecidable if the terms contain bound variables but decidable if they don t
منابع مشابه
Decidable and Undecidable Second-Order Unification Problems
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-order unification. Word unification can be easily decided by transformation rules (similar to the ones applied in higher-order unification procedures) when variables are restricted to occur at most twice. Hence a well-kno...
متن کاملPattern Unification for the Lambda Calculus with Linear and Affine Types
Logic programming languages, type inference algorithms, and automated theorem provers are all examples of systems that rely on unification. If the unification problem has to deal with logic variables at higher type (functional type), we speak of higher-order unification [4]. Higher-order unification is in general undecidable, but it can be turned decidable, if appropriately restricted to a frag...
متن کاملRegular expression order-sorted unification and matching
We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and decidable. The unification problem presented by us generalizes some known problems, such as, e.g...
متن کاملHigher-Order Dynamic Pattern Unification for Dependent Types and Records
While higher-order pattern unification for the λ-calculus is decidable and unique unifiers exists, we face several challenges in practice: 1) the pattern fragment itself is too restrictive for many applications; this is typically addressed by solving sub-problems which satisfy the pattern restriction eagerly but delay solving sub-problems which are non-patterns until we have accumulated more in...
متن کاملTowards Deciding Second-order Unification Problems Using Regular Tree Automata
The second-order unification problem is undecidable. While unification procedures, like Huet’s pre-unification, terminate with success on unifiable problems, they might not terminate on non-unifiable ones. There are several decidability results for infinitary unification, such as for monadic second-order problems. These results are based on the regular structure of the solutions of these proble...
متن کامل